System dynamics methodology has attracted researchers in different fields with the claim of recognizing the main structure of techno-socio-economic behaviors.Undoubtedly, philosophical and theoretical foundations of system dynamics or it's assumptions play an important role in the modeling process for the explanation of a problem and policy-making such that there might be different modeling processes and subsequently distinct outcomes with different foundations and also, there might be conflict between the modeler's expectations from this methodology and what would happen, in reality.However, system dynamics philosophy hadn’t been explained well from the beginning and years after its emergence and its being developed in other fields, there was a declaration from SD’s specialists in this regard. Subsequently, suggestions that are sometimes dissimilar were proposed. Thus, in this research, after reviewing proposed ideas and explaining the reasons of their dispersal; we have tried to reach a holistic explanation of system dynamics philosophy.In this regard, by using a deductive approach, philosophical foundations of SD models designed with this method are surveyed. The outcome of this survey is a paradigmatic classification of system dynamics models based on their dominant philosophical foundations. These are: positivist system dynamics, post positivist system dynamics, critical pluralist system dynamics, pragmatist system dynamics, constructivist system dynamics, transformative-emancipatory-critical system dynamics, and interpretivist system dynamics. According to this classification, it can be claimed that there are different approaches as the philosophical foundations of system dynamics. The author’s suggestion is a combined pluralism, which means based on the surveyed problem a special kind of paradigm will dominate the modeling process.

Compared to corpora-based machine translation methods, rule-based methods have deficiencies, which make them unattractive for the researchers of this field. The first problem is that these methods are language dependent. Rule-based methods require the syntactic information about source and target languages. On the other hand, in many cases, especially for proverbs and specific expressions, syntactic rules are no longer useful. In such cases, the use of example-based approaches is inevitable. In this work, we propose and integrate a set of novel schemes to introduce a new translation system, called BORNA. First a grammar induction method based on the Expectation Maximization (EM) algorithm is proposed. After representing the extracted knowledge in the form of a set of nested finite automata, a recursive model is proposed, which uses a combination of rule and example based techniques. In the translation phase, through a hierarchical chunking process, the input sentence is divided into a set of phrases. Each phrase is searched in the corpus of examples. If the phrase is found, it will not be chunked anymore.Otherwise, the phrase is divided into smaller sub-phrases. The simulation results show that BORNA outperforms its counterparts, significantly. Compared to PARS, Frengly and Google translators, BORNA receives the highest Bleu scores for its translations, while it results in the minimum values for different error measures, including PER, TER and WER.

A new sub-structure called (vivid) deductive system is introduced and their properties are examined. Conditions for a subset to be a deductive system are provided. The notion of upper GE-set is also introduced, and an example to show that any upper GE-set may not be a deductive system are supplied. Conditions for an upper GE-set to be a deductive system are provided. An upper GE-set is used to consider conditions for a subset to be a deductive system. The characterization of deductive system is established, and relationship between deductive system and vivid deductive system are created. Conditions for a deductive system to be a vivid deductive system are given, and the extension property for vivid deductive system is constructed.

Feedback control loops are hidden but ubiquitous mechanisms all around the modern world. The current control technology utilizes model-based advanced control systems design. The philosophical background thought behind such designs is an inductivism-based reductionist-mechanistic approach. Despite its outstanding problem-solving achievements, it is argued that a deduction-based philosophical approach in the form of data-driven control system design has emerged. Unfalsified control is a notable outcome of philosophical thinking and is briefly reviewed.

The Stoics believed that valid arguments are reduced to “undemonstrated’s’’ through “thema’s”. This interpretation, implied by ancient authors, considers Stoic logic as an axiomatic system with argumental rules. On the basis of this view on Stoic logic, undemonstrated’s are used as axioms and Themas as transmission rules. Yet, SextusEmpiricus in his book, Against the Logicians, introduced two examples of Stoic reduction of valid arguments to undemonstrated’s in which he used undemonstrated’s as sentential rules. In this approach, undemonstrated’s are used as inference rules and Themas don’t play any different reasonable role than undemonstrated’ss; on the other words, undemonstrated’s and Themas are used as inference rules. Mates and Bochenski didn’t attention to this conflict and analyzed these two examples like Empiricus. This paper brings up this conflict and suggests two solutions for it. Based on first solution, Stoic logic has two various surfaces and in each surface, it includes one of argumental or sentential rules; Therefore argumental rules and sentential rules can be used simultaneously. In second solution, based on the historical development of Stoic logic, two mentioned interpretations are attributed to Stoics in different historical periods.

In this paper, first we define the concept of nilpotent element on a hoop H, study some properties of them and investigate the relation with ultra deductive systems. Then by using this notion, we introduce cyclic hoops and prove that every cyclic hoop has a unique generator and is a local MV-algebra. In the follows, we introduce the notion of Boolean elements on hoops and investigate some of their properties and relation among Boolean elements with ultra deductive systems and nilpotent elements. Finally, we introduce a functor between the category of hoops and category of Boolean elements of them.